Lambda-calculus terms that reduce to themselves.
نویسندگان
چکیده
منابع مشابه
Generating Random Lambda Calculus Terms
We explore the problem of generating lambda calculus terms of a given size uniformly at random. This work has several motivations. First, through performing statistical sampling experiments with randomly generated terms, we can study interesting properties of lambda calculus terms. Second, random lambda calculus terms can serve as inputs to program analysis algorithms such as type inference alg...
متن کاملCounting Terms in the Binary Lambda Calculus
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent lambda terms and derive results from their generating functions, especially that the number of terms of size n grows roughly like 1.963447954n.
متن کاملInvertible Terms in the Lambda Calculus
It is well-known that the set of h -terms modulo &-convertibility is a semi-group with I as identity element and composition 0, defined by M 0 N = BMN, where B = hxyt . x(yz). In [6, pp. 167,168] the question is raised under what conditions an element in this semi-group has an inverse. DezanXiancaglini gave in [8] a characterization of (w.r.t. A&-calculus) invertible terms having a normal form ...
متن کاملLambda terms for natural deduction, sequent calculus and cut elimination
It is well-known that there is a good correspondence between natural deduction derivations and typed lambda terms. Moreover normalizing these terms is equivalent to eliminating cuts in the corresponding sequent calculus derivations. Several papers have been written on this topic. The correspondence between sequent calculus derivations and natural deduction derivations is, however, not a one-to-...
متن کاملIntroduction to Lambda Calculus
ion is said to bind the free variable x in M . E.g. we say that λx.yx has x as bound and y as free variable. Substitution [x := N ] is only performed in the free occurrences of x: yx(λx.x)[x := N ] ≡ yN(λx.x). In calculus there is a similar variable binding. In ∫ b a f(x, y)dx the variable x is bound and y is free. It does not make sense to substitute 7 for x: ∫ b a f(7, y)d7; but substitution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1976
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093887539